Local search heuristics for discrete structural optimization with expensive black-box evaluations
نویسندگان
چکیده
This paper considers structural optimization problems featuring discrete variables, as well as nonlinear implicit constraints which can only be evaluated through time-expensive computations. A prominent application consists in the preliminary structural design of large ships, where many of the variables take their values in discrete sets which model standard element dimensions to be selected from catalogs, and where the evaluation of the constraints involves a complex structural analysis performed by black-box software. The resulting large-scale nonlinear combinatorial problems are particularly hard, and even finding a discrete feasible solution may prove challenging for some instances. In this paper, we propose two heuristics that combine local search methods and a sequential optimization method based on approximations of the implicit constraints. The heuristics are applied to the structural optimization of several large ships. For these instances, the heuristics provide discrete feasible solutions whose value is close to the optimal value of the continuous relaxation obtained by disregarding the discrete nature of the variables.
منابع مشابه
A discrete particle swarm optimization algorithm with local search for a production-based two-echelon single-vendor multiple-buyer supply chain
This paper formulates a two-echelon single-producer multi-buyer supply chain model, while a single product is produced and transported to the buyers by the producer. The producer and the buyers apply vendor-managed inventory mode of operation. It is assumed that the producer applies economic production quantity policy, which implies a constant production rate at the producer. The operational pa...
متن کاملMISO: Mixed-Integer Surrogate Optimization Framework
We introduce MISO, the Mixed-Integer Surrogate Optimization framework. MISO aims at solving computationally expensive black-box optimization problems with mixed-integer variables. Although encountered in many applications, such as optimal reliability design or structural optimization, for example, where time consuming simulation codes have to be run in order to obtain an objective function valu...
متن کاملSO-MI: A surrogate model algorithm for computationally expensive nonlinear mixed-integer black-box global optimization problems
This paper introduces a surrogate model based algorithm for computationally expensive mixed-integer black-box global optimization problems that may have computationally expensive constraints. The goal is to find accurate solutions with relatively few function evaluations. A radial basis function surrogate model (response surface) is used to select candidates for integer and continuous decision ...
متن کاملStochastic radial basis function algorithms for large-scale optimization involving expensive black-box objective and constraint functions
Optimization Involving Expensive Black-Box Objective and Constraint Functions Rommel G. Regis Mathematics Department, Saint Joseph’s University, Philadelphia, PA 19131, USA, [email protected] August 23, 2010 Abstract. This paper presents a new algorithm for derivative-free optimization of expensive black-box objective functions subject to expensive black-box inequality constraints. The proposed al...
متن کاملMode Pursuing Sampling Method for Discrete Variable Optimization on Expensive Black-Box Functions
Based on previously developed Mode Pursuing Sampling (MPS) approach for continuous variables, a variation of MPS for discrete variable global optimization problems on expensive black-box functions is developed in this paper. The proposed method, namely, the discrete variable MPS (D-MPS) method, differs from its continuous variable version not only on sampling in a discrete space, but moreover, ...
متن کامل